Segregated Binary Trees: Address-Ordered Binary Trees Revisited
ثبت نشده
چکیده
Dynamic memory management has been an active research area for the last four decades. The primary goals of any memory management technique are the speed of allocation & delloaction; and efficient storage utilization. In this paper, we introduce two new memory allocation techniques: Address Ordered Binary Trees (ABT) and Segregated Binary Trees (SBT). Our empirical results show how Address Ordered and Segregated Binary Trees can outperform other mechanisms with respect to storage utilization. In addition, the Segregated Binary Trees compare favorably with Segregated Free List approaches in terms of execution time.
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملA bijection from ordered trees to binary trees that sends the pruning order to the strahler number
It is well known (e.g. [3], p. 60) that the number of ordered trees with n vertices equals the number of complete binary trees with n leaves. Vauchaussade de Chaumont and Viennot [4,6] ( see also [3], ch. 3, ex. 6 (p. 103)) discovered an interesting refinement of this fact. They proved that for any integers n and k, the number of ordered trees with IZ vertices and pruning order k equals the num...
متن کاملConvexity, Non–Crossing Tree Partitions and Independent Sets in Phylogenetic Trees
Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000